Rectilinear Spanning Trees Versus Bounding Boxes
نویسندگان
چکیده
منابع مشابه
Rectilinear Spanning Trees Versus Bounding Boxes
For a set P ⊆ R2 with 2 ≤ n = |P | < ∞ we prove that mst(P ) bb(P ) ≤ 1 √2 √ n + 32 where mst(P ) is the minimum total length of a rectilinear spanning tree for P and bb(P ) is half the perimeter of the bounding box of P . Since the constant 1 √ 2 in the above bound is best-possible, this result settles a problem that was mentioned by Brenner and Vygen (Networks 38 (2001), 126-139).
متن کاملRectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
We consider a setting where we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp , p = {p1, . . . , pn}, where the cost of (Ri, Rj) ∈ E is the distance between pi and pj . The Shortest Path Problem with Neighborhoods asks, for given Rs and Rt, to find a placement p ...
متن کاملFinding the Best-Fit Bounding-Boxes
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding-box is the smallest bounding-box among all the possible orientations for the same shape. In the context of document image analysis, the shapes can be characters (individual components) or paragraphs (component groups...
متن کاملBounding Boxes for Compact Sets in E
We define pseudocompact topological spaces and prove that every compact space is pseudocompact. We also solve an exercise from [16] p.225 that the for a topological space X the following are equivalent: • Every continuous real map from X is bounded (i.e. X is pseudocompact). • Every continuous real map from X attains minimum. • Every continuous real map from X attains maximum. Finally, for a co...
متن کاملDynamic Collision Detection using Oriented Bounding Boxes
2 Oriented Bounding Boxes 5 2.1 Separation of OBBs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Testing for Intersection of OBBs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2.1 Stationary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2.2 Constant Velocities . . . . . . . . . . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2004
ISSN: 1077-8926
DOI: 10.37236/1853